/* Copyright (c) 2001-2008, The HSQL Development Group
 * All rights reserved.
 *
 * Redistribution and use _in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * Redistributions _in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer _in the documentation
 * and/or other materials provided with the distribution.
 *
 * Neither the name of the HSQL Development Group nor the names of its
 * contributors may be used to endorse or promote products derived from this
 * software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL HSQL DEVELOPMENT GROUP, HSQLDB.ORG,
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */


using System;
using System.Collections.Generic;
using EffiProz.Core.Store;



namespace EffiProz.Core.Lib
{


    /**
     * This class does not store null keys.
     *
     * @author fredt@users
     * @version 1.7.2
     * @since 1.7.2
     */
    public class IntValueHashMap : BaseHashMap
    {

        Set _keySet;

        public IntValueHashMap()
            : this(16, 0.75f)
        {

        }

        public IntValueHashMap(int initialCapacity)
            : this(initialCapacity, 0.75f)
        {

        }

        public IntValueHashMap(int initialCapacity,
                               float loadFactor)
            : base(initialCapacity,  BaseHashMap.objectKeyOrValue,
                BaseHashMap.intKeyOrValue, false)
        {

        }

        public int get(Object key)
        {

            if (key == null)
            {
                throw new KeyNotFoundException();
            }

            int hash = key.GetHashCode();
            int lookup = getLookup(key, hash);

            if (lookup != -1)
            {
                return intValueTable[lookup];
            }

            throw new KeyNotFoundException();
        }

        public int get(Object key, int defaultValue)
        {

            if (key == null)
            {
                throw new KeyNotFoundException();
            }

            int hash = key.GetHashCode();
            int lookup = getLookup(key, hash);

            if (lookup != -1)
            {
                return intValueTable[lookup];
            }

            return defaultValue;
        }

        public bool get(Object key, int[] value)
        {

            if (key == null)
            {
                throw new KeyNotFoundException();
            }

            int hash = key.GetHashCode();
            int lookup = getLookup(key, hash);

            if (lookup != -1)
            {
                value[0] = intValueTable[lookup];

                return true;
            }

            return false;
        }

        public Object getKey(int value)
        {

            BaseHashIterator it = new BaseHashIterator(this,false);

            while (it.hasNext())
            {
                int i = it.nextInt();

                if (i == value)
                {
                    return objectKeyTable[it.getLookup()];
                }
            }

            return null;
        }

        public bool put(Object key, int value)
        {

            if (key == null)
            {
                throw new KeyNotFoundException();
            }

            int oldSize = size();

            base.addOrRemove(0, value, key, null, false);

            return oldSize != size();
        }

        public bool remove(Object key)
        {

            int oldSize = size();

            base.addOrRemove(0, 0, key, null, true);

            return oldSize != size();
        }

        public override  bool containsKey(Object key)
        {
            return base.containsKey(key);
        }

        public bool containsValue(int value)
        {
            throw new Exception();
        }

        public Set keySet()
        {

            if (_keySet == null)
            {
                _keySet = new KeySet(this);
            }

            return _keySet;
        }

        class KeySet : Set
        {

            IntValueHashMap _o;
            public KeySet(IntValueHashMap _o)
            {
                this._o = _o;
            }

            public Iterator iterator()
            {
                return new BaseHashIterator(_o, true);
            }

            public int size()
            {
                return _o.size();
            }

            public bool contains(Object o)
            {
                return _o.containsKey(o);
            }

            public Object get(Object key)
            {

                int lookup = _o.getLookup(key, key.GetHashCode());

                if (lookup < 0)
                {
                    return null;
                }
                else
                {
                    return _o.objectKeyTable[lookup];
                }
            }

            public bool add(Object value)
            {
                throw new Exception();
            }

            public bool addAll(Collection c)
            {
                throw new Exception();
            }

            public bool remove(Object o)
            {

                int oldSize = size();

                _o.remove(o);

                return size() != oldSize;
            }

            public bool isEmpty()
            {
                return size() == 0;
            }

            public void clear()
            {
                _o.clear();
            }
        }

        public void putAll(IntValueHashMap t)
        {

            Iterator it = t.keySet().iterator();

            while (it.hasNext())
            {
                Object key = it.next();

                put(key, t.get(key));
            }
        }
    }
}
